The Stirling Polynomial of a Simplicial Complex
نویسنده
چکیده
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an appropriate generalized binomial coefficient. We prove that the face numbers of the barycentric subdivision of the free join of two CW -complexes may be found by multiplying the Stirling polynomials of the barycentric subdivisions of the original complexes. We show that the Stirling polynomial of the order complex of any simplicial poset and of certain graded planar posets has non-negative coefficients. By calculating the Stirling polynomial of the order complex of the r-cubical lattice of rank n + 1 in two ways, we provide a combinatorial proof for the following identity of Bernoulli polynomials: 1 + r n ∑
منابع مشابه
Invariance of the barycentric subdivision of a simplicial complex
In this paper we prove that a simplicial complex is determined uniquely up to isomorphism by its barycentric subdivision as well as its comparability graph. We also put together several algebraic, combinatorial and topological invariants of simplicial complexes.
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملCohen-Macaulay-ness in codimension for simplicial complexes and expansion functor
In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $tgeq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we provethat it can be obtained from a Buchsbaum complex.
متن کاملStirling Numbers and Generalized Zagreb Indices
We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 35 شماره
صفحات -
تاریخ انتشار 2006